RAPPORT Verification of a distributed summation algorithm
نویسندگان
چکیده
A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an intuitive way to think about and understand this algorithm.
منابع مشابه
Algebraic verification of a distributed summation algorithm
In this note we present an algebraic veriication of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for veriication exercises (see 2, 13, 8]). The veriication is based on the methodology presented in 7] and demonstrates its applicability to distributed algorithms.
متن کاملA Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems
Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the...
متن کامل0 v 1 5 M ar 2 00 6 Four - loop verification of algorithm for Feynman diagrams summation in N = 1 supersymmetric electrodynamics
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N = 1 supersymmetric electrodynamics, regularized by higher derivatives. In particular, for the considered diagrams correctness of an additional identity for Green functions, which is not reduced to the gauge Ward identity, is proved.
متن کاملFaster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
Several batch-verification algorithms for original ECDSA signatures are proposed for the first time in AfricaCrypt 2012. Two of these algorithms are based on the naive idea of taking square roots in the underlying fields, and the others perform symbolic manipulation to verify small batches of ECDSA signatures. In this paper, we use elliptic-curve summation polynomials to design a new ECDSA batc...
متن کاملA Verification Environment for Imperative and Functional Programs in the Theorema system
We present a verification environment for imperative programs (using Hoare logic) and for functional programs (using fixpoint theory) in the frame of the Theorema system (www.theorema.org). In particular, we discuss some methods for finding the invariants of loops and of specifications of auxiliary tail recursive functions. These methods use algorithms from (polynomial) algebra and combinatoric...
متن کامل